import java.awt.Point;

/**
 * Node class for our tree. Includes information on finding bounds.
 * @author Erica Putsche
 *
 */
public class Node {
	private String my_name;
	private int my_height; 
	private int my_width; 
	private int my_x_coord; 
	private int my_y_coord; 
	
	public Node(String name, int height, int width, int x, int y) {
		my_name = name; 
		my_height = height; 
		my_width = width; 
		my_x_coord = x; 
		my_y_coord = y; 
	}
	
	public String getName() {
		return my_name; 
	}
	
	public Point getTopMidPoint() {
		int x = getX() + (getWidth() / 2);
		Point p = new Point(x, getY());
		return p;
	}
	
	public Point getBottomMidPoint() {
		int x = getX() + (getWidth() / 2);
		int y = getY() + getHeight();
		Point p = new Point(x, y); 
		return p;
	}
	
	public int getHeight() {
		return my_height; 
	}
	
	public int getWidth() {
		return my_width; 
	}
	
	public int getX() {
		return my_x_coord; 
	}
	
	public int getY() {
		return my_y_coord; 
	}
}
